Possibilistic vs. Relational Semantics for Logics of Incomplete Information
نویسندگان
چکیده
This paper proposes an extension of the MEL logic to a language containing modal formulae of depth 0 or 1 only. MEL is a logic of incomplete information where an agent can express both beliefs and explicitly ignored facts, that only uses modal formulae of depth 1, and no objective ones. The extended logic, called MEL has the same axioms as, and is in some sense equivalent to, S5 with a restricted language, but with the same expressive power. The semantics is not based on Kripke models with equivalence relations, but on pairs made of an interpretation (representing the real state of facts) and a non-empty set of possible interpretations (representing an epistemic state). Soundness and completeness are established. We provide a rationale for using our approach when an agent reasons about what is known of the epistemic state of another agent and compares it with what is known about the real world. Our approach can be viewed as an alternative to the basic epistemic logic not concerned with introspection. We discuss the difference with S5 used as a logic for rough sets, and the similarity with some previous non-monotonic logics of knowledge is highlighted.
منابع مشابه
PStable Semantics for Possibilistic Logic Programs
Uncertain information is present in many real applications e.g., medical domain, weather forecast, etc. The most common approaches for leading with this information are based on probability however some times; it is difficult to find suitable probabilities about some events. In this paper, we present a possibilistic logic programming approach which is based on possibilistic logic and PStable se...
متن کاملPossibilistic and Extended Logic Programs
Based on our earlier work on partial logics and extended logic programs Wag91, Wag94, HJW96], and on the possibilistic logic of DLP94], we deene a compositional possibilistic rst-order logic with two kinds of negation as the logical basis of semi-possibilistic and possibilis-tic logic programs. We show that in the same way as the minimal model semantics of relational databases can be reened to ...
متن کاملPossibilistic Safe Beliefs vs. Possibilistic Stable Models
In any learning process, the learners arrive with a great deal of variables, such as their different learning styles, their affective states and their previous knowledge, among many others. In most cases, their previous knowledge is incomplete or it comes with a certain degree of uncertainty. Possibilistic Logic was developed as an approach to automated reasoning from uncertain or prioritized i...
متن کاملSemantics for Possibilistic Disjunctive Programs
In this paper, a possibilistic disjunctive logic programming approach for modeling uncertain, incomplete and inconsistent information is defined. This approach introduces the use of possibilistic disjunctive clauses which are able to capture incomplete information and incomplete states of a knowledge base at the same time. By considering a possibilistic logic program as a possibilistic logic th...
متن کاملOn modal extensions of Product fuzzy logic
In this paper we study modal extensions of Product fuzzy logic with both relational semantics based on Kripke structures with crisp accessibility relations and algebraic semantics, when the underlying product fuzzy logic is expanded with truth-constants, the ∆ operator and with two infinitary inference rules. We provide completeness results for both kinds of semantics. Finally, we also consider...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014